Randomizing and Describing Groups
نویسندگان
چکیده
In this work we study some topics in logic and group theory, and naturally, their intersection. One important theme in this work is the notion of random groups, which is informally the study of “what properties do ‘most’ groups satisfy?” In Chapter 2, we are interested in the theory of a random group, i.e., the properties we are interested here are first-order properties. Knight conjectured that the limit of the theories of random groups should converge to the theory of the free groups. In this chapter, we establish some partial results in the one-quantifier case. In Chapter 3, instead of looking at a random group, we focus our attention on only the class of nilpotent groups, and look at a random nilpotent group. We analyze the distribution of ranks of random nilpotent groups, and establish some threshold result on when a random nilpotent group will be finite and trivial. In Chapter 4, we turn our attention to regular (non-random) groups, and we study the complexities of Scott sentences and the index sets of groups. We show that many groups that are “tame” in the sense of group theory have low-complexity Scott sentences and index sets.
منابع مشابه
Dual function of first position nominal groups in research article titles: Describing methods and structuring summary
Previous research has identified the nominal group as the most distinctive feature of the research article title. In contrast, the findings reported in this paper suggest Theme/Rheme is the dominant structure in title text. Theme/Rheme structures order and tie nominal groups in titles. When a title starts with a methodological term the first position nominal group acts as a theme marker. Thus, ...
متن کاملThe randomizing FFT : an alternative to pivoting in
Recently, randomizing input transformations have been developed for streamlining Gaussian elimination. Multiplying by special sparse random matrices, these transformations produce an equivalent linear system which, with probability 1, Gaussian elimination can solve without any augmentation by pivoting. In this paper we study properties of the unitary Randomizing Discrete Fourier Transform (RDFT...
متن کاملPerfect Constant-Round Secure Computation via Perfect Randomizing Polynomials
Various information-theoretic constant-round secure multiparty protocols are known for classes such as NC and polynomial-size branching programs [1, 13, 18, 3, 19, 10]. All these protocols have a small probability of failure, or alternatively use an expected constant number of rounds, suggesting that this might be an inherent phenomenon. In the current paper we prove that this is not the case b...
متن کاملAntiviral treatment in severe acute hepatitis B
Materials and methods We performed a study in the National Institute for Infectious Diseases “Prof. Dr. Matei Bals”, Bucharest, Romania, randomizing patients between two groups initially: therapy with lamivudine 100 mg/day vs. standard of care (no antiviral therapy) and subsequently between three groups: lamivudine, standard of care and entecavir 0.5 mg/day, when this new analogue became availa...
متن کاملRandomizing Reductions of Search Problems
This paper closes a gap in the foundations of the theory of average case complexity. First, we clarify the notion of a feasible solution for a search problem and prove its robustness. Second, we give a general and usable notion of many-one randomizing reductions of search problems and prove that it has desirable properties. All reductions of search problems to search problems in the literature ...
متن کامل